Preattentive bias for snake words in snake phobia?

The relationship between cognitive avoidance and attentional bias for snake-related thoughts.

Building on the work of Lavy and van den Hout (Lavy, E. H., & van den Hout, M. A. (1994a). Cognitive avoidance and attentional bias: Causal relationships. Cognitive Therapy and Research, 18 (2) 179-191; Lavy, E. H., & van den Hout, M. A. (1994b). Cognitive avoidance and attentional bias: Causal relationships. Behavior Therapy, 24, 645-657), the purpose of the present study was to examine a func...

How specific is specific phobia? Different neural response patterns in two subtypes of specific phobia

Specific phobia of the animal subtype has been employed as a model disorder exploring the neurocircuitry of anxiety disorders, but evidence is lacking whether the detected neural response pattern accounts for all animal subtypes, nor across other phobia subtypes. The present study aimed at directly comparing two subtypes of specific phobia: snake phobia (SP) representing the animal, and dental ...

The study of the snake fauna of Taloo and Shirband hunting prohibited area in Semnan Province, Iran

Taloo and Shirband hunting Prohibited area is located 12 kilometers North-East of Damghan in Semnan Province, south of the Alborz Mountain Chains. It has a cold and dry climate in the winter and warm and dry in the summer. This area has a rich biodiversity, especially in its reptilian fauna. 22 snake species were reported so far from Semnan Province. However, no comprehensice study was executed...

Use of Snake Antivenom and Clinical Outcomes in Snake Envenomation: A Retrospective Study in a Tertiary Hospital in Penang, Malaysia

Vertex Equitable Labeling of Double Alternate Snake Graphs

Let G be a graph with p vertices and q edges and A = {0, 1, 2, . . . , [q/2]}. A vertex labeling f : V (G) → A induces an edge labeling f∗ defined by f∗(uv) = f(u) + f(v) for all edges uv. For a ∈ A, let vf (a) be the number of vertices v with f(v) = a. A graph G is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in A, |vf (a) − vf (b)| ≤ 1 and the indu...